Typed Dependency Relations for Syntactic Analysis of Thai Sentences
نویسنده
چکیده
This paper describes a preliminary effort in identifying many different types of relations among words in Thai sentences based on dependency grammar. The relation is represented as a triple containing the pair of words and their relation. So far, the current representation contains 35 grammatical relations. The dependencies are all binary relations. That is, a grammatical relation holds between a governor and a dependent. The analysis makes use of the Thai “Orchid” corpus part-of-speech tags and the Stanford typed dependencies definitions.
منابع مشابه
Feature Engineering in Persian Dependency Parser
Dependency parser is one of the most important fundamental tools in the natural language processing, which extracts structure of sentences and determines the relations between words based on the dependency grammar. The dependency parser is proper for free order languages, such as Persian. In this paper, data-driven dependency parser has been developed with the help of phrase-structure parser fo...
متن کاملAn annotation scheme for Persian based on Autonomous Phrases Theory and Universal Dependencies
A treebank is a corpus with linguistic annotations above the level of the parts of speech. During the first half of the present decade, three treebanks have been developed for Persian either originally or subsequently based on dependency grammar: Persian Treebank (PerTreeBank), Persian Syntactic Dependency Treebank, and Uppsala Persian Dependency Treebank (UPDT). The syntactic analysis of a sen...
متن کاملComplex Lexico-syntactic Reformulation of Sentences Using Typed Dependency Representations
We present a framework for reformulating sentences by applying transfer rules on a typed dependency representation. We specify a list of operations that the framework needs to support and argue that typed dependency structures are currently the most suitable formalism for complex lexico-syntactic paraphrasing. We demonstrate our approach by reformulating sentences expressing the discourse relat...
متن کاملA Persian Treebank with Stanford Typed Dependencies
We present the Uppsala Persian Dependency Treebank (UPDT) with a syntactic annotation scheme based on Stanford Typed Dependencies. The treebank consists of 6,000 sentences and 151,671 tokens with an average sentence length of 25 words. The data is from different genres, including newspaper articles and fiction, as well as technical descriptions and texts about culture and art, taken from the op...
متن کاملGenerating Typed Dependency Parses from Phrase Structure Parses
This paper describes a system for extracting typed dependency parses of English sentences from phrase structure parses. In order to capture inherent relations occurring in corpus texts that can be critical in real-world applications, many NP relations are included in the set of grammatical relations used. We provide a comparison of our system with Minipar and the Link parser. The typed dependen...
متن کامل